翻訳と辞書 Words near each other ・ Maximus Lobo ・ Maximus Musicus ・ Maximus of Aveia ・ Maximus of Constantinople ・ Maximus of Ephesus ・ Maximus of Hispania ・ Maximus of Jerusalem ・ Maximus of Moesia ・ Maximus of Naples ・ Maximus of Pavia ・ Maximus of Rome ・ Maximus of Salzburg ・ Maximus of Turin ・ Maximus of Tyre ・ Maximus of Évreux ・ Maximum common edge subgraph problem ・ Maximum common subgraph isomorphism problem ・ Maximum Contaminant Level ・ Maximum Conviction ・ Maximum coverage problem ・ Maximum cut ・ Maximum Darkness ・ Maximum demand indicator ・ Maximum density ・ Maximum Destruction ・ Maximum Diner ・ Maximum disjoint set ・ Maximum Downside Exposure (MDE) ・ Maximum Drive ・ Maximum elevation figure Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Maximum common edge subgraph problem ： ウィキペディア英語版 Maximum common edge subgraph problem Given two graphs $G$ and $G\text{'}$, the maximum common edge subgraph problem is the problem of finding a graph $H$ with as many edges as possible which is isomorphic to both a subgraph of $G$ and a subgraph of $G\text{'}$. The maximum common edge subgraph problem on general graphs is NP-complete as it is a generalization of subgraph isomorphism: a graph $H$ is isomorphic to a subgraph of another graph $G$ if and only if the maximum common edge subgraph of $G$ and $H$ has the same number of edges as $H$. Unless the two inputs $G$ and $G\text{'}$ to the maximum common edge subgraph problem are required to have the same number of vertices, the problem is APX-hard.〔.〕 == See also == *Maximum common subgraph isomorphism problem *Subgraph isomorphism problem *Induced subgraph isomorphism problem 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Maximum common edge subgraph problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.